A Real-time Systolic Algorithm for On-the--y Hidden Surface Removal
نویسندگان
چکیده
Hidden surface removal for real-time realistic display of complex scenes requires intensive computation and justiies usage of parallelism to provide the needed response time. We present a systolic algorithm that identiies visible segments on a scanline with the \real-time" characteristic: visible segments are output on-they as soon as segments are input to the systolic array. The proposed systolic architecture consists of a linear array of simple cells. The size of the systolic array is equal to the maximum number of input segments that are crossed by a vertical line. The correctness of the systolic algorithm is proven by rst establishing the correctness of an initial version, which is then successively transformed to more eecient versions, while preserving the properties for correctness.
منابع مشابه
Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کاملConservative From-Point Visibility
Visibility determination has been an important part of the computer graphics research for several decades. First studies of the visibility were hidden line removal algorithms, and later hidden surface removal algorithms. Today’s visibility determination is mainly concentrated on conservative, object level visibility determination techniques. Conservative methods are used to accelerate the rende...
متن کاملModeling and Experimental Prediction of Wastewater Treatment Efficiency in Oil Refineries Using Activated Sludge Process
In this study, activated sludge process for wastewater treatment in a refinery was investigated. For such purpose, a laboratory scale rig was built. The effect of several parameters such as temperature, residence time, effect of Leca (filling-in percentage of the reactor by Leca) and UV radiation on COD removal efficiency were experimentally examined. Maximum COD removal efficiency was obtained...
متن کاملSpace-Efficient Hidden Surface Removal
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings, for example to reduce working space for several graph algorithms. However, bit manipulation is not usually employed in geometric algorithms because the stan...
متن کاملA Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of n iso-oriented rectangles we report all visible surfaces in O((n+ k) log n) time and linear space, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993